Alternating sign matrices with one -1 under vertical reflection
نویسنده
چکیده
We define a bijection that transforms an alternating sign matrix A with one −1 into a pair (N,E) where N is a (so called) neutral alternating sign matrix (with one −1) and E is an integer. The bijection preserves the classical parameters of Mills, Robbins and Rumsey as well as three new parameters (including E). It translates vertical reflection of A into vertical reflection of N . A hidden symmetry allows the interchange of E with one of the remaining two new parameters. A second bijection transforms (N,E) into a configuration of lattice paths called “mixed configuration”. 1 Alternating sign matrices Recall that a square matrix A = (aij)1≤i,j≤n is an order n alternating sign matrix if aij ∈ {1, 0,−1} and if, in each row and each column, the non-zero entries alternate in sign, beginning and ending with a 1. Thus, the entries of each row and of each column add up to 1. The entries in the first row of an alternating sign matrix are all 0 except for one, which must be a 1. It will be called the first 1. In their paper [MRR], Mills, Robbins and Rumsey defined the following parameters on order n alternating sign matrices A = (aij): • r(A) is the number of entries to the left of the first 1. We have 0 ≤ r(A) ≤ n− 1. • s(A) is the number of entries that are equal to −1.
منابع مشابه
On refined enumerations of totally symmetric self-complementary plane partitions II
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper “Self-complementary totally symmetric plane partitions” J. Combin. Theory Ser. A 42, 277–292. In other words we show that the number of shifted plane partitions invariant under the involution γ is equal to the number of alternating sign matrices invariant under the vertical flip....
متن کاملExtreme Diagonally and Antidiagonally Symmetric Alternating Sign Matrices of Odd Order
For each α ∈ {0, 1,−1}, we count alternating sign matrices that are invariant under reflections in the diagonal and in the antidiagonal (DASASMs) of fixed odd order with a maximal number of α’s along the diagonal and the antidiagonal, as well as DASASMs of fixed odd order with a minimal number of 0’s along the diagonal and the antidiagonal. In these enumerations, we encounter product formulas t...
متن کاملDiagonally and Antidiagonally Symmetric Alternating Sign Matrices of Odd Order
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model involves a grid graph on a triangle, with bulk and boundary weights which satisfy the Yang–Baxter and reflection equations. We obtain a general expression for t...
متن کامل2–enumerations of Halved Alternating Sign Matrices
2–ENUMERATIONS OF HALVED ALTERNATING SIGN MATRICES THERESIA EISENKÖLBL Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. E-mail: [email protected] Abstract. We compute 2–enumerations of certain halved alternating sign matrices. In one case the enumeration equals the number of perfect matchings of a halved Aztec diamond. In the other case the e...
متن کاملAffine Alternating Sign Matrices
An Alternating sign matrix is a square matrix of 0’s, 1’s, and −1’s in which the sum of the entries in each row or column is 1 and the signs of the nonzero entries in each row or column alternate. This paper attempts to define an analogue to alternating sign matrices which is infinite and periodic. After showing the analogue we define shares desirable cahracteristics with alternating sign matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 113 شماره
صفحات -
تاریخ انتشار 2006